A Framework for (Under)specifying Dependency Syntax without Overloading Annotators
نویسندگان
چکیده
We introduce a framework for lightweight dependency syntax annotation. Our formalism builds upon the typical representation for unlabeled dependencies, permitting a simple notation and annotation workflow. Moreover, the formalism encourages annotators to underspecify parts of the syntax if doing so would streamline the annotation process. We demonstrate the efficacy of this annotation on three languages and develop algorithms to evaluate and compare underspecified annotations.
منابع مشابه
Getting more data - Schoolkids as annotators
We present a new way to get more morphologically and syntactically annotated data. We have developed an annotation editor tailored to school children to involve them in text annotation. Using this editor, they practice morphology and dependency-based syntax in the same way as they normally do at (Czech) schools, without any special training. Their annotation is then automatically transformed in...
متن کاملA Dependency-based Analysis of Treebank Annotation Errors
In this paper, we investigate errors in syntax annotation with the Turku Dependency Treebank, a recently published treebank of Finnish, as study material. This treebank uses the Stanford Dependency scheme as its syntax representation, and its published data contains all data created in the full double annotation as well as timing information, both of which are necessary for this study. First, w...
متن کاملSimplified Dependency Annotations with GFL-Web
This is the motivating question behind GFL-Web, which uses the Fragmentary Unlabeled Dependency Grammar, or FUDG (Schneider et al. 2013), to make syntactic representations easier on annotators. FUDG is written using the Graph Fragment Language or GFL, a simple ASCII-based notation, which annotators can master in a few minutes. This framework allows annotators to work quickly, underspecify where...
متن کاملStatic semantic analysis and theorem proving for CASL
This paper presents a static semantic analysis for CASL, the Common Algebraic Speciication Language. Abstract syntax trees are generated including subsorts and overloaded functions and predicates. The static semantic analysis, through the implementation of an overload resolution algorithm, checks and qualiies these abstract syntax trees. The result is a fully qualiied CASL abstract syntax tree ...
متن کاملPassage Feedback for News Tracking
We extend the event tracking task of Topic Detection and Tracking (TDT) to create a framework in which a user can highlight relevant passages in addition to specifying the relevance of documents. A dual framework of combined document and passage feedback improves performance over a state-of-the-art system without feedback by over 70% . Although annotators vary in the content and length of the p...
متن کامل